Optimising Ground Stations Scheduling with a Genetic Algorithm
نویسندگان
چکیده
Ground stations (GS) are required during spacecraft (SC) operations to provide communications links between operation teams and the SC systems. Traditionally, the allocation of ground resources to SC is a highly constrained problem with sufficiently few solutions, where the process is conducted manually: stations are selected for communication support with certain SC for certain periods. There are many benefits in using a limited number of GSs and sharing the communication resource among different missions, other than install individual GS for them. To make the process adaptable in different mission scenarios, an automated process is needed to perform the scheduling and supervising resource allocation. The problem falls into the combinatorial optimisation area [1]. We propose to approach the problem with Genetic Algorithms (GAs), which have many applications on solving schedule problems [2]. This paper will present a method of approaching the solution of GS scheduling problem with a designated GA.
منابع مشابه
Optimal Fixed Interval Satellite Range Scheduling
The satellite scheduling community has provided several algorithms for allocating interaction windows between ground stations and satellites, from simple greedy approaches to more complex hybrid-genetic or Lagrangian-relaxation techniques. Single-location ground station problems, where requests have fixed time intervals and no priorities, are known to be solvable in polynomial time. To the best...
متن کاملScheduling a constellation of agile earth observation satellites with preemption
In this paper, we consider a scheduling problem for a set of agile Earth observation satellites for scanning different parts of the Earth’s surface. We assume that preemption is allowed to prevent repetitive images and develop four different preemption policies. Scheduling is done for the imaging time window and transmission time domain to the Earth stations as well. The value of each picture ...
متن کاملTrain Scheduling Problem - Phase II: A Simulation Integrated Genetic AlgorithmSystem
In [1] a feasible timetable generator stochastic simulation modeling framework for the train scheduling problem was developed to obtain a train timetable which includes train arrival and departure times at all visited stations and calculated average train travel time for all trains in the system. In this study, the framework is integrated with a genetic algorithm (GA) in order to get an optimal...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کامل